New Douglas-Rachford Algorithmic Structures and Their Convergence Analyses

In this paper we study new algorithmic structures with DouglasRachford (DR) operators to solve convex feasibility problems. We propose to embed the basic two-set-DR algorithmic operator into the String-Averaging Projections (SAP) and into the Block-Iterative Projection (BIP) algorithmic structures, thereby creating new DR algorithmic schemes that include the recently proposed cyclic DouglasRachford algorithm and the averaged DR algorithm as special cases. We further propose and investigate a new multiple-set-DR algorithmic operator. Convergence of all these algorithmic schemes is studied by using properties of strongly quasi-nonexpansive operators and rmly nonexpansive operators.